Results on communication complexity classes
نویسندگان
چکیده
منابع مشابه
Results on Communication Complexity Classes
Deterministic, probabilistic, nondeterministic, and alternating complexity classes defined by polylogarithmic communication are considered. Main results are (1) extending work of Ja’Ja’, Prasanna Kumar, and Simon, we give a simple technique allowing translation of most known separation and containment results for complexity classes of the fixed partition model to the more difficult optimal part...
متن کاملOn relations between counting communication complexity classes
We develop upper and lower bound arguments for counting acceptance modes of communication protocols. A number of separation results for counting communication complexity classes is established. This extends the investigation of the complexity of communication between two processors in terms of complexity classes initiated by Babai, Frankl, and Simon [Proc. 27th IEEE FOCS 1986, pp. 337{347] and ...
متن کاملSurvey: Large Communication Complexity Classes
Since the introduction of communication complexity four decades ago, complexity theorists have generally achieved better results and separations in communication complexity than in normal complexity classes. For instance, it is known that no pair of P, BPP, NP, and PP are equal, while not a single pair of all the corresponding normal classes P, BPP, NP, and PP have been proven different. Fewer ...
متن کاملfocus on communication in iranian high school language classes: a study of the role of teaching materials in changing the focus onto communication in language classes
چکیده ارتباط در کلاس به عوامل زیادی از جمله معلمان، دانش آموزان، برنامه های درسی و از همه مهم تر، مواد آموزشی وابسته است. در تدریس ارتباطی زبان که تاکید زیادی بر توانش ارتباطی دارد، کتاب درسی به عنوان عامل موثر بر پویایی کلاس محسوب میگردد که درس ها را از طریق فراهم آوردن متن ارتباط کلاسی و هم چنین نوع تمرین زبانی که دانش آموزان در طول فعالیت های کلاسی به آن مشغول اند، کنترل می کند. این حقیقت ک...
15 صفحه اولComplexity Results for Classes of Quantificational Formulas
We analyze the computational complexity of determining whether F is satisfiable when F is a formula of the classical predicate calculus obeying certain syntactic restrictions. For example, for the monadic predicate calculus and the Code1 or 3 ’ .. WV3 1.. 3 prefix class we obtain lower and upper nondeterministic time bounds of the form c”/“‘~“. The lower bounds are established by using acceptan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1992
ISSN: 0022-0000
DOI: 10.1016/0022-0000(92)90025-e